Adaptive Solvers for High-Dimensional PDE Problems on Clusters of Multicore Processors

نویسنده

  • Magnus Grandin
چکیده

Grandin, M. 2014. Adaptive Solvers for High-Dimensional PDE Problems on Clusters of Multicore Processors. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1199. 34 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9095-9. Accurate numerical solution of time-dependent, high-dimensional partial differential equations (PDEs) usually requires efficient numerical techniques and massive-scale parallel computing. In this thesis, we implement and evaluate discretization schemes suited for PDEs of higher dimensionality, focusing on high order of accuracy and low computational cost. Spatial discretization is particularly challenging in higher dimensions. The memory requirements for uniform grids quickly grow out of reach even on large-scale parallel computers. We utilize high-order discretization schemes and implement adaptive mesh refinement on structured hyperrectangular domains in order to reduce the required number of grid points and computational work. We allow for anisotropic (non-uniform) refinement by recursive bisection and show how to construct, manage and load balance such grids efficiently. In our numerical examples, we use finite difference schemes to discretize the PDEs. In the adaptive case we show how a stable discretization can be constructed using SBP-SAT operators. However, our adaptive mesh framework is general and other methods of discretization are viable. For integration in time, we implement exponential integrators based on the Lanczos/Arnoldi iterative schemes for eigenvalue approximations. Using adaptive time stepping and a truncated Magnus expansion, we attain high levels of accuracy in the solution at low computational cost. We further investigate alternative implementations of the Lanczos algorithm with reduced communication costs. As an example application problem, we have considered the time-dependent Schrödinger equation (TDSE). We present solvers and results for the solution of the TDSE on equidistant as well as adaptively refined Cartesian grids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards an Adaptive Solver for High-Dimensional PDE Problems on Clusters of Multicore Processors

Accurate numerical simulation of time-dependent phenomena in many spatial dimensions is a challenging computational task apparent in a vast range of application areas, for instance quantum dynamics, financial mathematics, systems biology and plasma physics. Particularly problematic is that the number of unknowns in the governing equations (the number of grid points) grows exponentially with the...

متن کامل

A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints

One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...

متن کامل

Dynamic load-balancing for PDE solvers on adaptive unstructured meshes

Modern PDE solvers written for time-dependent problems increasingly employ adaptive unstructured meshes (see Flaherty et al. [4]) in order to both increase e ciency and control the numerical error. If a distributed memory parallel computer is to be used, there arises the signi cant problem of dividing up the domain equally amongst the processors whilst minimising the intersubdomain dependencies...

متن کامل

Dynamic Load-Balancing For PDE Solvers Using Adaptive Unstructured Meshes

Modern PDE solvers written for time-dependent problems increasingly employ adaptive unstructured meshes (see Flaherty et al. [4]) in order to both increase e ciency and control the numerical error. If a distributed memory parallel computer is to be used, there arises the signi cant problem of dividing up the domain equally amongst the processors whilst minimising the intersubdomain dependencies...

متن کامل

Menus-pgg : a Mapping Environment for Unstructured and Structured Numerical Parallel Grid Generation

MENUS-PGG is a problem solving environment (PSE) for developing parallel algorithms that generate structured and unstructured static and adaptive grids (or meshes) required for the implementation of scalable parallel partial di erential equation (PDE) solvers based on domain decomposition methods. Whereas the rst generation PSEs for the numerical solution of PDEs on distributed memory multiproc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014